English  |  正體中文  |  简体中文  |  2809390  
???header.visitor??? :  27004706    ???header.onlineuser??? :  1028
???header.sponsordeclaration???
 
臺灣學術機構典藏系統 (Taiwan Academic Institutional Repository, TAIR)
???ui.leftmenu.abouttair???

???ui.leftmenu.bartitle???

???index.news???

???ui.leftmenu.copyrighttitle???

???ui.leftmenu.link???

"ravi r"???jsp.browse.items-by-author.description???

???jsp.browse.items-by-author.back???
???jsp.browse.items-by-author.order1??? ???jsp.browse.items-by-author.order2???

Showing items 1-6 of 6  (1 Page(s) Totally)
1 
View [10|25|50] records per page

Institution Date Title Author
臺大學術典藏 2020-05-04T07:56:46Z A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree. Lu, Hsueh-I; Ravi, R.; HSUEH-I LU
臺大學術典藏 2020-05-04T07:56:39Z A fast approximation algorithm for maximum-leaf spanning tree Lu, H.-I.; Ravi, R.; HSUEH-I LU
臺大學術典藏 2020-05-04T07:56:39Z Approximating Maximum Leaf Spanning Trees in Almost Linear Time HSUEH-I LU; Ravi, R.; Lu, H.-I.
臺大學術典藏 2018-09-10T06:59:55Z Polynomial time approximation scheme for minimum routing cost spanning trees Wu, Bang Ye; Lancia, Giuseppe; Bafna, Vineet; Chao, Kun-Mao; Ravi, R.; Tang, Chuan Yi; KUN-MA0 CHAO
臺大學術典藏 2018-09-10T03:28:00Z A polynomial-time approximation scheme for minimum routing cost spanning trees Wu, B.Y.; Lancia, G.; Bafna, V.; Chao, K.-M.; Ravi, R.; Tang, C.Y.; KUN-MA0 CHAO
國立臺灣大學 2000-03 A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees Wu, B. Y.; Lancia, G.; Bafna, V.; Chao, K.-M.; Ravi, R.; Tang, C. Y.

Showing items 1-6 of 6  (1 Page(s) Totally)
1 
View [10|25|50] records per page